منابع مشابه
Split-critical and uniquely split-colorable graphs
The split-coloring problem is a generalized vertex coloring problem where we partition the vertices into a minimum number of split graphs. In this paper, we study some notions which are extensively studied for the usual vertex coloring and the cocoloring problem from the point of view of split-coloring, such as criticality and the uniqueness of the minimum split-coloring. We discuss some proper...
متن کاملIntegral Complete Split Graphs
We give characterizations of integral graphs in the family of complete split graphs and a few related families of graphs.
متن کاملFully Decomposable Split Graphs
Wediscuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is fully decomposable, that is, whether it can be partitioned into connected parts of orders α1, α2, . . . , αk for every α1, α2, . . . , αk summing up to the order of the graph. In contrast, we show that the decision problem...
متن کاملPebbling in Split Graphs
Finding the pebbling number of a graph is harder than NP-complete (Π 2 complete, to be precise). However, for many families of graphs there are formulas or polynomial algorithms for computing pebbling numbers; for example, complete graphs, products of paths (including cubes), trees, cycles, diameter two graphs, and more. Moreover, graphs having minimum pebbling number are called Class 0, and ma...
متن کاملDynamically maintaining split graphs
We present an algorithm that supports operations for modifying a split graph by adding edges or vertices and deleting edges, such that after eachmodification the graph is repaired to become a split graph in a minimal way. In particular, if the graph is not split after the modification, the algorithm computes a minimal, or if desired even a minimum, split completion or deletion of themodified gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2003
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(03)00030-1